A New Particle Swarm Optimization for Multi- objective Open Shop Scheduling
نویسندگان
چکیده
Multi-objective open-shop scheduling is definitely significant in practical. However, the research focused on multi-objective open-shop scheduling was relatively scarce. This article proposed a particle swarm optimization to address open-shop scheduling problems with multiple objectives. Originally, particle swarm optimization was invented to treat continuous optimization problems. In this paper, the particle position representation, particle velocity and particle movement are modified due to the discrete essence of the scheduling problem. The modified PSO was tested on solving various benchmark problems to evaluate its performance. The results demonstrated that the algorithm dividing the swarm into three sub-swarms for each object performs better than using only one swarm for all three objectives. Keywords-Particle Swarmt; Open Shop; Multi-objective
منابع مشابه
A Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملSwarm lexicographic goal programming for fuzzy open shop scheduling
In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...
متن کاملVariable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) and Particle Swarm Optimization(PSO). The proposed VNPSO method is used for solving the multi-objective Flexible Job-shop Scheduling Problems (FJSP). The details of implementation for the multi-objective FJSP and the c...
متن کاملParticle swarm optimization algorithm applied to scheduling problems
This research introduces three heuristic algorithms for solving job-shop scheduling problems, job-shop scheduling problems with multi-purpose machines, and open-shop scheduling problems. All these algorithms are based on the particle swarm optimization algorithm, and generate solutions that belong to the class of parameterized active schedules via their specific decoding procedures. Comparison ...
متن کاملA multi-objective particle swarm for a flow shop scheduling problem
Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. Since a flow shop scheduling problem has been proved to be NP-hard in strong sense, an effective multi-objectiv...
متن کامل